Lucid—A Formal System for Writing and Proving Programs

Lucid - A Formal System for Writing and Proving Programs

Lucid is both a programming language and a formal system for proving properties of Lucid programs. The programming language is unconventional in many ways, although programs are readily understood as using assignment statements and loops in a “structured” fashion. Semantically, an assignment statement is really an equation between “histories”, and a whole program is simply an unordered set of s...

diagnostic and developmental potentials of dynamic assessment for writing skill

این پایان نامه بدنبال بررسی کاربرد ارزیابی مستمر در یک محیط یادگیری زبان دوم از طریق طرح چهار سوال تحقیق زیر بود: (1) درک توانایی های فراگیران زمانیکه که از طریق برآورد عملکرد مستقل آنها امکان پذیر نباشد اما در طول جلسات ارزیابی مستمر مشخص شوند; (2) امکان تقویت توانایی های فراگیران از طریق ارزیابی مستمر; (3) سودمندی ارزیابی مستمر در هدایت آموزش فردی به سمتی که به منطقه ی تقریبی رشد افراد حساس ا...

Methods and Logics for Proving Programs

ion function: (37) α : P(Γ) → (Lab[C] → Ass) (.1) α(i)( L ) = {s : ∈ i} if L ∈ At[C] ∪ In[C] (.2) α(i)( L ) = i ∩ S if L ∈ After[C] (.3) Since α is a bijection, the inverse of which is γ, the discovery of a global invariant i ∈ P(Γ) satisfying verification condition gvc[C][p, q](i) is equivalent to the discovery of local invariants inv(L), L ∈ L a b [ C ] satisfying verification conditio...

NQTHM proving sequential programs

Formal Verification of Pure Production System Programs

Reliability, defined as the guarantee that a program satisfies its specifications, is an important aspect of many applications for which rule-based expert systems are suited. Executing rule-based programs on a series of test cases. To show a program is reliable, it is desirable to construct formal specifications for the program and to prove that it obeys those specifications. This paper present...